Weighted-CAPIC Caching Algorithm for Priority Traffic in Named Data Network

Today, the internet requires many additional mechanisms or protocols to support various ever-growing applications. As a future architecture candidate, Named Data Network (NDN) offers solution that naturally fulfills this need. One of critical components in NDN is cache. Caching solves bandwidth usage, server load, and service time. Some research about caching has been conducted, but improvements can be made. In research, we derived utility function multiclass content obtain relationship between class’s weight cache hit ratio. Then, formulated it into Weighted-CAPIC algorithm. Our shows provides higher ratio for priority class whole system. This performance supported while algorithm still same path-stretch value as Dynamic-CAPIC. The suitable used mobile nodes due its ability work individually without having coordinate with other nodes.